On sequentially adaptive asymptotically efficient rank statistics
نویسندگان
چکیده
منابع مشابه
Linear Parameter Estimation : Asymptotically Efficient Adaptive Strategies
This paper considers the problem of distributed adaptive linear parameter estimation in multiagent inference networks. Local sensing model information is only partially available at the agents, and interagent communication is assumed to be unpredictable. The paper develops a generic mixed time-scale stochastic procedure consisting of simultaneous distributed learning and estimation, in which th...
متن کاملEfficient Calculation of Jackknife Confidence Intervals for Rank Statistics
An algorithm is presented for calculating concordance-discordance totals in a time of order N logN , where N is the number of observations, using a balanced binary search tree. These totals can be used to calculate jackknife estimates and confidence limits in the same time order for a very wide range of rank statistics, including Kendall’s tau, Somers’ D, Harrell’s c, the area under the receive...
متن کاملDistributed Linear Parameter Estimation: Asymptotically Efficient Adaptive Strategies
The paper considers the problem of distributed adaptive linear parameter estimation in multi-agent inference networks. Local sensing model information is only partially available at the agents and inter-agent communication is assumed to be unpredictable. The paper develops a generic mixed time-scale stochastic procedure consisting of simultaneous distributed learning and estimation, in which th...
متن کاملEfficient asymptotically-optimal path planning on manifolds
This paper presents an efficient approach for asymptotically-optimal path planning on implicitly-defined configuration spaces. Recently, several asymptotically-optimal path planners have been introduced, but they typically exhibit slow convergence rates. Moreover, these planners can not operate on the configuration spaces that appear in the presence of kinematic or contact constraints, such as ...
متن کاملComputational rank-based statistics
This review discusses two algorithms which can be used to compute rank-based regression estimates. For completeness, a brief overview of rank-based inference procedures in the context of a linear model is presented. The discussion includes geometry, estimation, inference, and diagnostics. In regard to computing the rank-based estimates, we discuss two approaches. The first approach is based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sequential Analysis
سال: 1985
ISSN: 0747-4946,1532-4176
DOI: 10.1080/07474948508836076